Companion to the Tutorial Cylindrical Algebraic Decomposition
نویسنده
چکیده
This handout is a companion to the ISSAC 2004 tutorial Cylindrical Algebraic Decomposition. It is not intended to stand on its own, rather it is written for someone who has attended the tutorial and taken in the background, motivation, and explanations given there. It is also not intended to thoroughly cite all works pertaining to CAD. It is intended to be a guide to someone who might want to read further on this subject. It is intended give quick recaps of the ideas and definitions arising in the talk. I hope it is able to serve that role.
منابع مشابه
Regular cylindrical algebraic decomposition
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global condition on P that holds for the output of many widely used algorithms. We also show the same for S of dimension at most 3 and P a strong cylindrical algeb...
متن کاملQuantifier Elimination in p-adic Fields
We present a tutorial survey of quantifier-elimination and decision procedures in p-adic :fieIds. The p-adic :fieIds are studied in the (so-called) P,,-formalism of Angus Macintyre, for whieh motivation is provided through a rieh body of analogies with real-closed :fields. Quantifier-elimination and decision procedures are described proceeding via a Cylindrical Algebraic Decomposition of affine...
متن کاملAbstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase Extended Version
Partial Cylindrical Algebraic Decomposition I: The Lifting Phase�
متن کاملHow to Use Cylindrical Algebraic Decomposition
We take some items from a textbook on inequalities and show how to prove them with computer algebra using the Cylindrical Algebraic Decomposition algorithm. This is an example collection for standard applications of this algorithm, intended as a guide for potential users.
متن کاملDivide-And-Conquer Computation of Cylindrical Algebraic Decomposition
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results using the algorithm first introduced in [34]. We propose a graph-based heuristic to find a suitable partitioning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004